A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
نویسندگان
چکیده
منابع مشابه
A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
Growing demand, increasing diversity of services, and advances in transmission and switching technologies are prompting telecommunication companies to rapidly expand and modernize their networks. This paper develops and tests a decomposition methodology to generate cost-effective expansion plans, with performance guarantees, for one major component of the network hierarchy-the local access netw...
متن کاملMulti-period capacity expansion for a local access telecommunications network
In this paper, we examine a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. Capacity expansion is realized through the installation of concentrators at the nodes and cables on the links of the network. Clearly, the installation of concentrators reduces the need for additional cables, and conversely. The goal is to find the least cost a...
متن کاملNetwork flow models for the local access network expansion problem
In the local access network expansion problem we need to expand a given network (with tree topology) due to traffic demand increase. We can expand the network either by increasing the capacity of its edges and/or by installing equipments that concentrate the traffic of several demand points. This problem has received some attention in the literature. Here, we view the problem as an extension of...
متن کاملA dynamic programming algorithm for the local access telecommunication network expansion problem
In this paper we consider the local access telecommunication network expansion problem, in which growing demand can be satis®ed by expanding cable capacities and/or installing concentrators in the network. The problem is known to be NP-hard. We prove that the problem is weakly NP-hard, and present a pseudo-polynomial dynamic programming algorithm for the problem, with time complexity O nB2 and...
متن کاملSolving railway line planning problems using a decomposition algorithm
The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1995
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.43.1.58